Abstract State Machines: Verification Problems and Complexity Dissertation
نویسنده
چکیده
State Machines: Verification Problems and Complexity
منابع مشابه
Abstract state machines: verification problems and complexity
State Machines: Verification Problems and Complexity Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Informatiker Marc Spielmann aus Duisburg Referent: Universitätsprofessor Dr. E. Grädel Koreferent...
متن کاملAbstract state machines: verification problems and computational power
State Machines: Verification Problems and Computational Power Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades einer Doktorin der Naturwissenschaften genehmigte Dissertation
متن کاملEnabling SystemC Verification using Abstract State Machines
SystemC is a system level language recently proposed to raise the abstraction level for embedded systems design and verification. We propose a verification methodology for SystemC designs based on a combination of static code analysis and SystemC semantics described with abstract state machines (ASM). We abstract the source SystemC design into hypergraphs to keep an abstract (simplified) view o...
متن کاملGames for Verification: Algorithmic Issues
This dissertation deals with a number of algorithmic problems motivated by computer aided formal verification of finite state systems. The goal of formal verification is to enhance the design and development of complex systems by providing methods and tools for specifying and verifying correctness of designs. The success of formal methods in practice depends heavily on the degree of automation ...
متن کاملThe Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.
متن کامل